Net-aware Critical Area extraction for VLSI opens via Voronoi diagrams
نویسنده
چکیده
We address the problem of computing critical area for opens in a circuit layout in the presence of loops and redundant interconnects. The extraction of critical area is the main computational problem in VLSI yield prediction for random manufacturing defects. Our approach first models the problem as a graph problem and solves it efficiently by exploiting its geometric nature. The approach expands the Voronoi critical area computation paradigm [10, 7] with the ability to accurately compute critical area for missing material defects in a net-aware fashion. Generalized Voronoi diagrams used in the solution are combinatorial structures of independent interest.
منابع مشابه
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
We address the problem of computing critical area for open faults in a circuit layout in the presence of multilayer loops and redundant interconnects. The extraction of critical area is a fundamental problem in VLSI yield prediction. We first model the problem as a graph problem and then we solve it efficiently by exploiting its geometric nature. We introduce the open-fault Voronoi diagram of p...
متن کاملThe Higher Order Hausdorff Voronoi Diagram and Vlsi Critical Area Extraction for Via-blocks
We extend the Voronoi diagram framework to compute the critical area of a circuit layout [15, 12, 16, 13, 14] with the ability to accurately compute critical area for via-blocks on via and contact layers in the presence of multilayer loops, redundant vias, and redundant interconnects. Critical area is a measure reflecting the sensitivity of a VLSI design to random defects during IC manufacturin...
متن کاملL∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly impor...
متن کاملExtraction of critical areas for opens in large VLSI circuits
This paper describes a new algorithm for the extraction of the critical area for opens. The presented algorithm allows for the analysis of large IC’s and non-Manhattan geometry. Concept of the contact/via contacting regions is proposed and its relevance is discussed. Illustrative examples of the proposed algorithm are presented.
متن کاملCritical Area Computation { a New
In this paper we present a new approach for computing the critical area for shorts in a circuit layout. The critical area calculation is the main computational problem in VLSI yield prediction. The method is based on the concept of Voronoi diagrams and computes the critical area for shorts (for all possible defect radii, assuming square defects) accurately in O(n log n) time, where n is the siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007